Termination w.r.t. Q of the following Term Rewriting System could not be shown:
Q restricted rewrite system:
The TRS R consists of the following rules:
f(x, y, z) → g(x, y, z)
g(0, 1, x) → f(x, x, x)
a → b
a → c
Q is empty.
↳ QTRS
Q restricted rewrite system:
The TRS R consists of the following rules:
f(x, y, z) → g(x, y, z)
g(0, 1, x) → f(x, x, x)
a → b
a → c
Q is empty.